Language, Liveness and Fairness Invariant in Decomposition of Petri Net Based on the Index of Place
نویسنده
چکیده
It is not easy to analyze the physical system with Petri net if the system is large-scaled and complex, mainly because the structure of the Petri net model is also complex. In order to overcome this difficulty, a decomposition method of Petri net based on an index function of places is introduced, with which a set of well-formed and structure-simple sub net systems can be obtained. For all the sub net systems, the number of all the input or output places of each transition is less than or equal to one. The relationships about the reachable states, languages, liveness and fairness between the original Petri net and its sub net systems are analyzed with details. The sufficient and necessary conditions are presented to keep the reachable states and languages invariant during the decomposition process, which is useful for analysis of liveness and fairness of structure-complex Petri net systems.
منابع مشابه
Deterministic Measurement of Reliability and Performance Using Explicit Colored Petri Net in Business Process Execution Language and Eflow
Today there are many techniques for web service compositions. Evaluation of quality parameters has great impact on evaluation of final product. BPEL is one of those techniques that several researches have been done on its evaluation. However, there are few researches on evaluation of QoS in eflow. This research tries to evaluate performance and reliability of eflow and BPEL through mapping them...
متن کاملAn Introduction to the Theoretical Aspects of Coloured Petri Nets
This paper presents the basic theoretical aspects of Coloured Petri Nets (CP-nets or CPN). CP-nets have been developed, from being a promising theoretical model, to being a full-fledged language for the design, specification, simulation, validation and implementation of large software systems (and other systems in which human beings and/or computers communicate by means of some more or less for...
متن کاملModeling and Analysis of the Associative Based Routing ( ABR ) Protocol by Using Coloured Petri Nets
In an ad-hoc mobile network where mobile hosts (MHs) are acting as routers and where routes are made inconsistent by MHs‘ movement. In associativity-based routing protocol (ABR) where a route is selected based on nodes having associativity states that imply periods of stability. In this manner, the routes selected are likely to be long-lived and provides maximum throughput. In this paper we cre...
متن کاملSoftware Tools for the Supervisory Control of Petri Nets Based on Place Invariants
This document describes a Matlab toolbox for the supervisory control of Petri nets based on place invariants [7, 9]. In what follows we present a detailed description of a number of functions we propose. These are the topics we address: • Solving integer programs • Transformations to admissible marking constraints • Enforcing linear constraints in Petri nets which may have uncontrollable and/or...
متن کاملDesign of -Liveness Enforcing Supervisors in Petri Nets
This paper presents a procedure for the design of supervisors that enforce the transitions in a given set to be live. -liveness enforcement corresponds to full liveness enforcement when equals the total set of transitions. Rather than assuming a given initial marking, this procedure generates at every iteration a convex set of admissible initial markings. In the case of full liveness enforcemen...
متن کامل